Some new orthogonal designs in orders 32 and 40
نویسندگان
چکیده
A result of Robinson states that no OD(n; 1, 1, 1, 1, 1, n− 5) exists for n > 40. We complement this result by showing the existence of OD(n; 1, 1, 1, 1, 1, n− 5) for n = 32, 40. This includes a resolution to an old open problem regarding orthogonal designs of order 32 as well. We also obtain a number of new orthogonal designs of order 32.
منابع مشابه
Some Optimal Codes From Designs
The binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. A new method is also introduced to study optimal codes.
متن کاملSome New Properties of the Searching Probability
Consider search designs for searching one nonzero 2- or 3-factor interaction under the search linear model. In the noisy case, search probability is given by Shirakura et al. (Ann. Statist. 24(6) (1996) 2560). In this paper some new properties of the searching probability are presented. New properties of the search probability enable us to compare designs, which depend on an unknown parameter ?...
متن کاملSome constructions for amicable orthogonal designs
Hadamard matrices, orthogonal designs and amicable orthogonal designs have a number of applications in coding theory, cryptography, wireless network communication and so on. Product designs were introduced by Robinson in order to construct orthogonal designs especially full orthogonal designs (no zero entries) with maximum number of variables for some orders. He constructed product designs of o...
متن کاملAn infinite family of skew weighing matrices
We verify the skew weighing matrix conjecture for orders 2t.7, t ~ 3 a positive integer, by showing that orthogonal (1, k) exist for all t k = 0, 1, .... , 2.7 1 in order 2t.7 We discuss the construction of orthogonal designs using circulant matrices. In particular we construct designs in orders 20 and 28. The weighing matrix conjecture is verified for order 60. Disciplines Physical Sciences an...
متن کاملOrthogonal Designs of Kharaghani Type: II
H. Kharaghani, in "Arrays for orthogonal designs", J. Combin. Designs, 8 (2000), 166-173, showed how to use amicable sets of matrices to construct orthogonal designs in orders divisible by eight. We show how amicable orthogonal designs can be used to make amicable sets and so obtain infinite families of orthogonal designs in six variables in orders divisible by eight.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 279 شماره
صفحات -
تاریخ انتشار 2004